Convergence Analysis on a Second Order Algorithm for Orthogonal Projection onto Curves

نویسندگان

  • Xiaowu Li
  • Lin Wang
  • Zhinan Wu
  • Linke Hou
  • Juan Liang
  • Qiaoyang Li
چکیده

Regarding the point projection and inversion problem, a classical algorithm for orthogonal projection onto curves and surfaces has been presented by Hu and Wallner (2005). The objective of this paper is to give a convergence analysis of the projection algorithm. On the point projection problem, we give a formal proof that it is second order convergent and independent of the initial value to project a point onto a planar parameter curve. Meantime, for the point inversion problem, we then give a formal proof that it is third order convergent and independent of the initial value.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A second order algorithm for orthogonal projection onto curves and surfaces

In this paper we analyze an algorithm which solves the point projection and the “inversion” problems for parametric curves and surfaces. It consists of a geometric second order iteration which converges faster than existing first order methods, and whose sensitivity to the choice of initial values is small. Applications include the ICP algorithm for shape registration.

متن کامل

Algorithm for orthogonal projection of parametric curves onto B-spline surfaces

This paper proposes an algorithm for calculating the orthogonal projection of parametric curves onto B-spline surfaces. It consists of a second order tracing method with which we construct a polyline to approximate the pre-image curve of the orthogonal projection curve in the parametric domain of the base surface. The final 3D approximate curve is obtained by mapping the approximate polyline on...

متن کامل

On improvement of the iterated Galerkin solution of the second kind integral equations

For a second kind integral equation with a kernel which is less smooth along the diagonal, an approximate solution obtained by using a method proposed by the author in an earlier paper, is shown to have a higher rate of convergence than the iterated Galerkin solution. The projection is chosen to be either the orthogonal projection or an interpolatory projection onto a space of piecewise polynom...

متن کامل

Convergence of an efficient local least-squares fitting method for bases with compact support

The least-squares projection procedure appears frequently in mathematics, science, and engineering. It possesses the well-known property that a least-squares approximation (formed via orthogonal projection) to a given data set provides an optimal fit in the chosen norm. The orthogonal projection of the data onto a finite basis is typically approached by the inversion of a Gram matrix involving ...

متن کامل

Hybrid Second-Order Iterative Algorithm for Orthogonal Projection onto a Parametric Surface

To compute the minimum distance between a point and a parametric surface, three well-known first-order algorithms have been proposed by Hartmann (1999), Hoschek, et al. (1993) and Hu, et al. (2000) (hereafter, the First-Order method). In this paper, we prove the method’s first-order convergence and its independence of the initial value. We also give some numerical examples to illustrate its fas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Symmetry

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2017